facetedpedia enabl queri ddepend facet search wikipedia turbo dcharg hidden databas sampler overflow queri skew reduct algorithm dsafe privaci dpreserv data publish versatil publish privaci preserv construct explor composit item nowadai onlin shop daili activ web user purchas varieti item rang book electron larg suppli onlin product call sophist techniqu user explor item propos build composit item associ central item set packag form satellit item user explor user shop iphon central item price budget present iphon packag item match iphon belkin case bose sounddock kroo usb cabl composit item total price user budget defin studi problem effect construct explor larg set packag central item design implement effici algorithm solv problem stage summar techniqu pick repres packag central item visual effect optim help user find divers composit item quickli minim overlap packag present user rank order conduct extens set experi yahoo shop data set demonstr effici effect algorithm unbias estim size aggreg hidden web databas mine time seri data decad wit tremend growth interest applic deal queri mine time seri data numer represent method dimension reduct similar measur gear time seri introduc individu work introduc method made specif claim occasion theoret justif provid quantit experiment observ part compar aspect experi narrowli focus demonstr benefit propos method previous introduc order provid comprehens valid conduct extens set time seri experi implement represent method similar measur variant test effect time seri data set wide varieti applic domain paper give overview techniqu present compar experiment find effect experi provid unifi valid exist achiev case suggest claim literatur unduli optimist facetedpedia dynam gener queri ddepend facet interfac wikipedia paper propos facetedpedia facet retriev system inform discoveri explor wikipedia set wikipedia articl result keyword queri facetedpedia gener facet interfac navig result articl compar facet retriev system facetedpedia fulli automat dynam facet gener hierarchi construct facet base rich semant inform wikipedia essenc approach build collabor vocabulari wikipedia specif intens intern structur hyperlink folksonomi categori system sheer size complex corpu space choic facet interfac prohibit larg propos metric rank individu facet hierarchi user navig cost metric rank interfac mine time seri data decad wit tremend growth interest applic deal queri mine time seri data numer represent method dimension reduct similar measur gear time seri introduc individu work introduc method made specif claim occasion theoret justif provid quantit experiment observ part compar aspect experi narrowli focus demonstr benefit propos method previous introduc order provid comprehens valid conduct extens set time seri experi implement represent method similar measur variant test effect time seri data set wide varieti applic domain paper give overview techniqu present compar experiment find effect experi provid unifi valid exist achiev case suggest claim literatur unduli optimist access cost dawar approach object retriev multipl sourc sourc object select retriev larg multi sourc data set fundament oper applic paper initi research effici sourc databas object select algorithm larg multi sourc data set specif order acquir number satisfi object minimum cost multipl databas queri engin determin access overhead individu data sourc overhead retriev object sourc possibl statist estim frequenc find satisfi object order determin object retriev data sourc adopt probabilist approach sourc select util cost structur dynam program model comput optim number object retriev data sourc structur valuabl asset monetari time relat cost access larg distribut databas present experiment evalu valid techniqu real world data set space effici group recommend tran top dk implement techniqu minimum effort driven facet search databas rank object base relationship fix associ text corpora enhanc addit metadata relat real world entiti document entiti discuss relationship typic obtain wide inform extract tool time interest associ typic hold entiti instanc corpu discuss hotel citi airlin fix associ entiti includ airlin oper flight citi hotel locat citi plethora applic necessit identif entiti match set keyword sampl queri find holidai packag pet friendli hotel locat histor live citi travel oper econom safe airlin keyword occur textual descript entiti actual hotel citi airlin answer queri exploit relationship entiti document keyword pet friendli occur document entiti hotel associ entiti hotel locat citi work focu class entiti packag finder queri outlin demonstr exist techniqu effici adapt solv problem result algorithm reli estim excess runtim storag overhead propos effici algorithm process queri larg corpora devis earli prune termin strategi presenc join aggreg execut entiti extract text depend estim analysi experiment evalu real synthet data demonstr effici scalabl approach top dk algorithm applic paper introduc distribut spatio tempor similar search problem queri trajectori find trajectori follow motion similar target trajectori segment number distribut node propos algorithm ub ublb combin local comput lower upper bound match distribut subsequ oper gener desir result pull distribut subsequ fundament expens commun medium solut find applic wide arrai domain cellular network wildlif monitor video surveil experiment evalu realist data demonstr framework cient robust varieti condit rank object base relationship fix associ text corpora enhanc addit metadata relat real world entiti document entiti discuss relationship typic obtain wide inform extract tool time interest associ typic hold entiti instanc corpu discuss hotel citi airlin fix associ entiti includ airlin oper flight citi hotel locat citi plethora applic necessit identif entiti match set keyword sampl queri find holidai packag pet friendli hotel locat histor live citi travel oper econom safe airlin keyword occur textual descript entiti actual hotel citi airlin answer queri exploit relationship entiti document keyword pet friendli occur document entiti hotel associ entiti hotel locat citi work focu class entiti packag finder queri outlin demonstr exist techniqu effici adapt solv problem result algorithm reli estim excess runtim storag overhead propos effici algorithm process queri larg corpora devis earli prune termin strategi presenc join aggreg execut entiti extract text depend estim analysi experiment evalu real synthet data demonstr effici scalabl approach dynacet build dynam facet search system databas abstract extract inform insight larg databas time consum activ receiv consider research attent recent demo present dynacet domain independ system effect minimum effort base dynam facet search solut enterpris databas step dynacet suggest facet depend user respons previou step facet select base abil rapidli drill promis tupl abil user provid desir valu benefit provid includ faster access inform store databas take consider varianc user knowledg prefer leverag count inform sampl hidden databas privaci risk health databas aggreg disclosur hdsampler reveal data web form interfac larg number onlin databas hidden web user system form queri web form retriev small sampl databas sampl hidden databas wide desir understand natur qualiti data store develop hdsampler knowledg practic system sampl structur hidden web databas enabl effici sampl databas accur answer aggreg queri provid analyst valuabl inform data analyt power multitud parti applic web mashup meta search engin purpos demo present instanc hdsampler googl base content rich hidden web databas maintain googl hdsampler demo reveal snapshot margin distribut attribut googl base matter minut privaci preserv aggreg hidden databas websit provid form interfac user execut search queri underli hidden databas paper explain import protect sensit aggreg inform hidden databas disclos individu tupl return search queri stand contrast tradit privaci problem individu tupl protect ensur access aggreg inform propos techniqu thwart bot sampl hidden databas infer aggreg inform present theoret analysi extens experi illustr effect approach categori subject descriptor determin attribut maxim visibl object recent year signific interest develop rank function effici top retriev algorithm user ad hoc search retriev databas buyer search product catalog introduc complementari problem guid seller select attribut tupl product highlight stand crowd exist competit product wide visibl pool potenti buyer develop formul problem problem np complet give exact approxim algorithm work practic type exact algorithm base integ program ip formul problem class exact method base maxim frequent itemset mine algorithm approxim algorithm base greedi heurist detail perform studi illustr benefit method real synthet data determin attribut maxim visibl object recent year signific interest develop rank function effici top retriev algorithm user ad hoc search retriev databas buyer search product catalog introduc complementari problem guid seller select attribut tupl product highlight stand crowd exist competit product wide visibl pool potenti buyer develop formul problem problem np complet give exact approxim algorithm work practic type exact algorithm base integ program ip formul problem class exact method base maxim frequent itemset mine algorithm approxim algorithm base greedi heurist detail perform studi illustr benefit method real synthet data measur ddriven keyword dqueri expans user gener content fuel explos amount textual data context common user express explicitli numer rate implicitli view opinion product event wealth textual inform necessit develop search data explor paradigm paper propos search model similar spirit facet search enabl progress refin keywordqueri result contrast facet search util domain specif hard extract document attribut refin process driven suggest interest expans origin queri addit search term queri driven domain neutral approach emploi surpris word occurr pattern option numer user rate order identifi meaning top queri expans focu interest subset origin result set propos function support framework computation effici nimbl term storag requir solut ground convex optim principl exploit prune opportun offer natur top formul problem perform benefit offer solut verifi synthet data larg real data set compris blog post group recommend semant effici studi problem group recommend recommend import inform explor paradigm retriev interest item user base profil past activ singl user recommend receiv signific attent past due extens amazon netflix recommend group user share similar tast open problem group recommend aris scenario movi friend watch travel destin famili spend holidai break good restaur colleagu work lunch intuit item ideal recommend group individu member paper analyz desiderata group recommend propos formal semant account item relev group disagr group member design implement algorithm effici comput group recommend evalu group recommend method comprehens user studi conduct amazon mechan turk demonstr incorpor disagr critic effect group recommend evalu effici scalabl algorithm movielen data set rate improv search social annot data social annot intuit line collabor process element collect resourc url pictur video group descript keyword wide tag group concis accur summari relev resourc content obtain aggreg opinion individu user express form short tag sequenc avail inform rise search paradigm resourc retriev rank base similar keyword queri accompani tag paper present principl effici search resourc rank methodolog util exclus userassign tag sequenc rank base solid probabilist foundat grow understand dynam structur social annot process captur emploi power interpol gram model tag sequenc effici applic propos solut larg data set guarante introduct highli scalabl constrain optim framework emploi train increment maintain gram model experiment valid effici effect solut compar applic approach evalu base larg crawl del icio number hundr thousand user million resourc demonstr applic solut real life larg scale system demonstr interpol gram model tag sequenc result superior rank effect propos optim framework superior term perform obtain rank paramet increment maintain keyword queri rank databas anytim measur top dk algorithm exact fuzzi data set proceed intern confer manag data minimum deffort driven dynam facet search structur databas paper propos minimum effort driven navig techniqu enterpris databas system base facet search paradigm propos techniqu dynam suggest facet drill databas cost navig minim step system ask user question set question facet depend user respons dynam fetch promis set facet process repeat facet select base abil rapidli drill promis tupl abil user provid desir valu facet select algorithm work conjunct rank retriev model rank function impos bia user prefer select tupl method principl effici experiment studi valid effect applic scenario categori subject descriptor databas manag system queri process stand crowd select attribut maximum visibl abstract recent year signific interest develop rank function effici top retriev algorithm user ad hoc search retriev databas buyer search product catalog paper focu complementari problem guid seller select attribut tupl product highlight stand crowd exist competit product wide visibl pool potenti buyer develop interest formul problem problem npcomplet give exact algorithm approxim heurist work practic exact algorithm base integ program ip formul problem adapt maxim frequent itemset mine algorithm approxim algorithm base greedi heurist conduct perform studi illustr benefit method real synthet data region sampl continu adapt sampl sensor network abstract satisfi energi constraint meet perform requir primari concern sensor network deploi recent propos techniqu offer error bound solut aggreg approxim guarante energi spend invers goal bound energi consumpt minim approxim error paper propos onlin algorithm region sampl comput approxim aggreg satisfi pre defin energi budget algorithm distinguish segment sensor network partit overlap region perform sampl local aggreg region sampl energi cost rate sampl statist collect analyz predict optim sampl plan comprehens experi real world data set approach minimum accur compar previous propos solut distinct estim peer dto dpeer network peer peer network popular internet million peer world share larg volum data assist healthcar sector network develop interconnect control share patient databas hospit clinic research laboratori sheer scale network made difficult gather statist build featur paper present techniqu obtain estim number distinct valu match queri network evalu techniqu experiment provid set result demonstr effect flexibl support varieti queri applic categor skylin stream data problem skylin comput attract consider research attent categor domain problem complic primarili due partial order natur attribut tupl paper initi studi stream categor skylin identifi limit exist work offlin categor skylin comput realiz techniqu problem maintain skylin categor data stream environ develop lightweight data structur index tupl stream buffer gracefulli adapt tupl attribut partial order domain size complex addition studi domin relat dual space util geometr arrang order index categor skylin effici evalu domin queri lastli experiment studi evalu effici propos techniqu effici sampl inform social network discret basi problem discret basi problem collect boolean vector find collect boolean basi vector origin vector repres disjunct basi vector show decis version problem np complet optim version approxim finit ratio studi variat problem boolean basi vector mutual otrhogon show variat close relat metric median problem boolean space solv problem algorithm present design variat mention sole base solv median problem heurist intend solv gener discret basi problem studi result extens experi made algorithm synthet real world data result twofold synthet data algorithm real world data result good analyz structur evolut massiv telecom graph abstract grow competit telecommun market oper increasingli reli busi intellig offer incent custom exist approach telecom busi intellig sole focus individu behavior custom paper call detail record mobil oper construct call graph graph induc peopl call determin structur properti graph introduc treasur hunt model describ shape mobil call graph determin structur call graph evolv time final short messag servic sm prefer mode commun section societi studi properti sm graph analysi interest similar differ sm graph call graph analysi techniqu telecom oper understand social behavior custom potenti provid major insight design effect incent star system tupl attribut rank queri answer integr develop environ web servic composit random walk approach sampl hidden databas advisor dr gautam da constant guidanc support give wonder opportun work challeng project involv depth knowledg probabl statist discuss practic interest aspect problem hand committe grate dr nan zhang dr leonida fegara serv parent brother sourc inspir friend constant support project academ career ii ad dhoc top dk queri answer data stream top queri retriev highest score tupl data set respect score function defin attribut tupl effici evalu top queri activ research topic instanti problem varieti set studi techniqu develop convent central distribut databas directli applic highli dynam environ line applic data stream recent techniqu support top queri data stream introduc techniqu restrict effici report top answer respect pre oppos ad hoc set queri paper introduc geometr represent top queri problem rais restrict util notion geometr arrang design analyz algorithm increment maintain data set organ arrang represent stream updat introduc queri evalu strategi oper top arrang data structur guarante effici evalu ad hoc queri perform core techniqu augment incorpor tupl prune strategi minim number tupl store manipul result main memori index techniqu support effici increment updat evalu ad hoc top queri experiment studi evalu effici propos techniqu anytim measur top dk algorithm top queri larg multi attribut data set fundament oper inform retriev rank applic paper initi research anytim behavior top algorithm specif top algorithm ta ta sort interest studi progress identif correct result point algorithm execut adopt probabilist approach seek report point oper algorithm confid top result identifi function valuabl asset interest reduc runtim cost top comput present experiment evalu valid techniqu synthet real data set comput coverag path presenc obstacl sensor field abstract studi presenc obstacl comput bcp coverag path point field surveil sensor set line segment obstacl point sensor plane path protect point path euclidean distanc closest sensor maximum distanc path cover minimum bcp present algorithm result opaqu obstacl obstruct path block sens capabl sensor comput bcp takeso log mn time space fortranspar obstacl obstruct path sens comput bcp take nm timeando space effort studi presenc obstacl coverag problem sensor network optim stratifi sampl approxim queri process abil approxim answer aggreg queri accur effici great benefit decis support data mine tool contrast previou sampl base studi treat problem optim problem workload queri select stratifi random sampl origin data error answer workload queri sampl minim kei novelti approach tailor choic sampl robust workload similar necessarili ident workload final techniqu recogn import take account varianc data distribut principl manner show solut implement databas system present result extens experi microsoft sql server demonstr superior qualiti method compar previou work effici approxim queri process peer dto dpeer network report intern workshop rank databas dbrank introduct special issu acm sigkdd vulner internet access mechan mobil ad hoc network structur properti massiv telecom call graph find implic xml queri rout structur system abstract paper address problem data placement index queri larg xml data repositori distribut exist servic infrastructur architectur scale gracefulli network data size fulli distribut fault toler selforgan handl complex queri effici queri full text search framework index distribut xml data base meta data inform textual content introduc data synopsi structur summar text correl textual posit inform increas queri rout precis process framework map xml queri full text search distribut program migrat peer peer collect relev document locat addit introduc method handl network updat node arriv departur failur final report prototyp implement valid accuraci data synops analyz cost involv index xml data answer queri approxim aggreg queri peer dto dpeer network discret basi problem discret basi problem collect boolean vector find collect boolean basi vector origin vector repres disjunct basi vector show decis version problem np complet optim version approxim finit ratio studi variat problem boolean basi vector mutual otrhogon show variat close relat metric median problem boolean space solv problem algorithm present design variat mention sole base solv median problem heurist intend solv gener discret basi problem studi result extens experi made algorithm synthet real world data result twofold synthet data algorithm real world data result good order attribut queri result great deal interest past year rank result queri structur databas includ work probabilist inform retriev rank aggreg algorithm merg order list applic sale home car electron good data item larg number attribut displai rank list item user attribut shown tradition select manual argu automat select attribut requir deal requir user formul problem optim problem choos set attribut attribut influenti rank item discuss variant notion attribut us propos hybrid split pane approach return composit top attribut variant conduct perform user studi illustr benefit algorithm term effici qualiti explan answer top dk queri view consider past work effici comput top object aggreg inform multipl rank list object import instanc problem queri process search engin combin inform post list rank web page object obtain top web page answer user queri studi approach achiev effici top aggreg includ earli termin algorithm ta nra preaggreg input list work rigor treatment combin approach gener ta nra algorithm case preaggreg intersect list addit origin list show version ta nra continu remain instanc optim strong optim notion highlight origin ta nra algorithm index million web page real world search engin queri empir character perform gain offer algorithm show practic benefit intersect list fulli realiz earli termin algorithm probabilist inform retriev approach rank databas queri result investig problem rank answer databas queri tupl return present methodolog tackl problem conjunct rang queri adapt appli principl probabilist model inform retriev structur data solut domain independ leverag data workload statist correl evalu qualiti approach user survei real databas present experiment evalu algorithm effici retriev top rank result demonstr feasibl rank system distribut core assist scalabl data dissemin mobil ad hoc network ccid core construct inform dissemin ad hoc scenario mine chain relat tradit data mine applic problem mine singl relat attribut scientif bibliographi databas author relat paper interest discov associ rule author real life multipl attribut relat chain relat author write paper paper concern topic mine relat chain pose addit challeng paper problem chain relat find selector object project relat satisfi specif properti motiv approach properti hold dataset hold project data selector set discuss algorithm examin condit apriori techniqu experiment demonstr effect method approxim queri process abstract approxim queri process emerg cost effect approach deal huge data volum stringent respons time requir todai decis support system dss work area limit queri process scope typic focus specif form aggreg queri convent approach base sampl histogram inher limit approxim result complex queri high dimension dss data set paper propos multi dimension wavelet effect tool gener purpos approxim queri process modern high dimension applic approach base build wavelet coeffici synops data synops provid approxim answer queri develop queri process mine time seri data decad wit tremend growth interest applic deal queri mine time seri data numer represent method dimension reduct similar measur gear time seri introduc individu work introduc method made specif claim occasion theoret justif provid quantit experiment observ part compar aspect experi narrowli focus demonstr benefit propos method previous introduc order provid comprehens valid conduct extens set time seri experi implement represent method similar measur variant test effect time seri data set wide varieti applic domain paper give overview techniqu present compar experiment find effect experi provid unifi valid exist achiev case suggest claim literatur unduli optimist hop count base lightweight qualiti servic model sensor devic proceed acm sigmod workshop research issu data mine knowledg discoveri intellig inform technolog abstract nowadai compani seek advanc inform system face overwhelm varieti fast pace innov inform technolog sector innov lead wai extend exist competit advantag leverag weak technolog progress character shorter technolog life cycl discontinu challeng develop inform system contribut compani competit advantag gather intellig inform technolog progress evalu strateg impact inform prepar decis make argu technolog form knowledg propos pattern base model languag captur model inform technolog demonstr applic model languag web servic relat technolog rotat invari distanc measur trajectori discoveri similar pattern time seri typic perform normal data transform data follow unit standard deviat transform reveal latent pattern commonli datamin applic deal multidimension time seri natur applic video track motion captur similar motion pattern express orient imper provid support addit transform rotat work transform posit inform move data space translat scale rotat invari distanc measur space detect elast match effici lower bound computation tractabl propos method easi implement fast comput applic real world problem area handwrit recognit postur estim motion captur data final empir demonstr accuraci effici techniqu real synthet handwrit data probabilist rank databas queri result investig problem rank answer databas queri tupl return adapt appli principl probabilist model inform retriev structur data propos solut domain independ leverag data workload statist correl rank function custom applic present result preliminari experi demonstr effici qualiti rank system summari dbase rout content dbase event distribut network abstract provid scalabl distribut web base event servic import research topic desir effect mechan server summar filter network preprocess order optim system perform paper propos summari base rout mechan introduc notion imprecis summari provid trade rout overhead event traffic system similar base filter cluster reduc event traffic perform tune summari precis select optim throughput implement summari base rout top xml base infrastructur close propos web servic standard measur actual implement valid analyt simul result demonstr practic benefit propos techniqu autom rank databas queri result investig problem rank answer databas queri tupl return adapt appli principl probabilist model inform retriev structur data propos solut domain independ leverag data workload statist correl rank function custom applic present result preliminari experi demonstr effici qualiti rank system dynam sampl select approxim queri process dbxplorer system keyword dbase search relat databas internet search engin popular keywordbas search paradigm tradit databas manag system offer power queri languag keyword base search paper discuss dbxplorer system enabl keywordbas search relat databas dbxplorer implement commerci relat databas web server user interact browser front end outlin challeng discuss implement system includ result extens experiment evalu dbxplorer enabl keyword search relat databas relat databas system offer powerfifl structur queri languag sql support keyword search databas simplic keyword search queri paradigm offer compel valu data explor specif keyword search requir priori knowledg schema signific inform corpor increasingli intranet unrealist expect user brows queri inform detail knowledg schema databas keyword search classif hierarchi complement document search keyword search databas effect overview dbxplorer present dbxplorer system enabl keyword search sql databas technic detail system found set queri keyword system return row singl tabl join tabl connect foreign kei join row keyword dba publish popul search symbol tabl optim comput shortest weakli visibl line segment insid simpl polygon simpl polygon weakli intern visibl line segment ly insid point boundari polygon visibl point line segment paper present optim linear time algorithm problem simpl polygon comput shortest line segment polygon weakli intern visibl report polygon weakli intern visibl overcom limit sampl aggreg queri studi problem approxim answer aggreg queri sampl observ uniform sampl perform poorli distribut aggreg attribut skew address issu introduc techniqu call outlier index uniform sampl ineffect queri low select reli weight sampl base workload inform overcom shortcom demonstr combin outlier index weight sampl answer aggreg queri significantli reduc approxim error compar uniform sampl weight sampl discuss implement techniqu microsoft sql server present experiment result demonstr merit techniqu robust gener nonparametr techniqu propos analysi complex multimod featur space delin arbitrarili shape cluster basic comput modul techniqu pattern recognit procedur shift prove discret data converg recurs shift procedur nearest stationari point underli densiti function util detect mode densiti equival shift procedur nadaraya watson estim kernel regress robust estim locat establish algorithm low level vision task discontinu preserv smooth imag segment applic algorithm user set paramet resolut analysi grai level color imag accept input extens experiment result illustr excel perform time seri similar measur time seri index lower bound comput geometr spanner approxim shortest path problem construct geometr spanner possibl steiner point set point dimension space ir construct spanner approxim shortest path collect polygon obstacl plane complex problem shown omega gamma log algebra comput tree model log time algorithm solv problem lower bound tight constant factor introduct geometr spanner data structur approxim complet graph set point dimension space ir sens shortest path base spanner pair point factor longer distanc point ir fix constant paper measur distanc point dimension space ir metric context dbase similar measur categor databas lower bound approxim geometr minimum weight match set point perfect match set edg point vertex edg weight perfect match sum euclidean length edg rao smith recent shown constant depend dimens perfect match weight equal time weight minimum weight perfect match comput log time show algorithm optim algebra comput tree model keyword minimum weight match lower bound comput geometri introduct set point small constant set edg point vertic set call perfect match point vertex edg word perfect match partit subset size weight wt rule discoveri time seri problem find rule relat pattern time seri pattern seri pattern seri pattern seri simpl rule period low telephon call activ sharp rise call volum exampl rule relat time seri microsoft stock price intel fall ibm dai microsoft strongli dai declin strongli dai dai intel stai level ibm stai level emphasi discoveri local pattern multivari time seri contrast tradit time seri analysi larg focus global model search rule condit refer pattern time seri defin pattern pattern form data similar attribut extern probe data mine similar distanc attribut central notion notion build attribut hierarchi similar metric user defin import problem defin similar basi data method base statist techniqu exist defin similar attribut typic valu attribut describ similar notion attribut defin valu attribut basic idea relat attribut similar subrel oe oe similar similar relat defin margin frequenc select subset attribut show framework produc natur notion similar empir result reuter document dataset show natur classif visibl graph bound ddegre spanner collect polygon obstacl vertic place present log time algorithm construct bound degre spanner visibl graph construct visibl graph introduct euclidean graph defin graph vertic point dimension space edg line segment join pair point edg weight underli distanc metric typic metric edg present graph complet euclidean graph complet euclidean graph complet euclidean graph visibl graph defin scenario collect pairwis disjoint polygon plane frequent aris motion plan problem polygon repres obstacl clutter workspac point robot navig graph polygon ver episod match word text length episod length episod match problem find minim length substr text episod subsequ respect optim problem find smallest number text subword length episod paper introduc effici line line algorithm entir problem line algorithm algorithm search left consecut text symbol present alphabet independ algorithm work time nm line algorithm oper addit space line algorithm pai properti addit space line algorithm subquadrat time complex work time nm log addit space time space trade work time nm log log log addit find similar time seri time dseri similar problem dsepar geometr set pair nonident complex object defin determin similar nontrivi problem data mine applic frequent determin similar time seri analyz model time seri similar outlier scale function present determinist random algorithm comput notion similar algorithm base nontrivi tool method comput geometri properti famili separ geometr set random algorithm provabl good perform work extrem effici practic introduct measur similar object crucial issu data retriev data mine applic gener discuss similar queri typic task defin function sim object class complex approxim euclidean travel salesman tour minimum span tree problem comput approxim travel salesman tour approxim minimum span tree set point ir constant algebra comput tree model complex problem shown theta log larger constant power model comput addition floor function random access problem solv time theta gamma introduct travel salesman problem tsp combinatori optim problem geometr version problem set point ir constant tour close path visit point return start point edg tour length equal euclidean distanc endpoint length tour su lr dvisibl polygon complex optim problem ddimension convex polyhedra decis tree show optim problem involv dimension convex polyhedra decis tree np hard np complet techniqu emploi linear time method realiz planar connect triangul convex polyhedron independ interest kei word convex polyhedra approxim steinitz theorem planar graph art galleri theorem decis tree introduct convex polyhedra fundament geometr structur product convex hull algorithm kei compon problem robot motion plan comput aid geometr design due beauti theorem steinitz provid strong link comput geometri graph theori steinitz show graph form edg structur convex polyhedra planar connect algorithm problem deal dimension convex polyhedra fast algorithm construct spars euclidean spanner lower bound comput geometr spanner approxim shortest path problem construct geometr spanner possibl steiner point set point dimension space ir construct spanner approxim shortest path collect polygon obstacl plane complex problem shown omega gamma log algebra comput tree model log time algorithm solv problem lower bound tight constant factor introduct geometr spanner data structur approxim complet graph set point dimension space ir sens shortest path base spanner pair point factor longer distanc point ir fix constant paper measur distanc point dimension space ir metric planar spanner approxim shortest path queri obstacl plane abstract problem find obstacl avoid path point plane amidst set disjoint polygon obstacl total vertic length path small constant factor length shortest obstacl avoid path measur lv metric approxim shortest path call short path short path stretch actor goal preprocess obstacl scatter plane creat effici data structur enabl fast report short path length paper give famili algorithm problem achiev interest trade stretch factor queri time preprocess bound main result algorithm achiev logarithm length queri time subquadrat time space preprocess complex approxim euclidean travel salesman tour minimum span tree problem comput approxim travel salesman tour approxim minimum span tree set point ir constant algebra comput tree model complex problem shown theta log larger constant power model comput addition floor function random access problem solv time theta gamma introduct travel salesman problem tsp combinatori optim problem geometr version problem set point ir constant tour close path visit point return start point edg tour length equal euclidean distanc endpoint length tour su construct degre spanner spars properti set point dimension euclidean space subgraph complet euclidean graph spanner length shortest path spanner time show gt exist polynomi time constructihl spanner constant depend properti maximum degre edg total edg weight compar minimum span tree lt weight wt mgt gt weight log wt mst weigh malnourish euclidean graph paper show euclidean graph set point dimension space satisfi leapfrog properti isol properti small weight weight wt smt smt steiner minim tree leapfrog properti isol properti constrain edg graph configur space main applic prove euclidean graph spanner construct optim weight wt smt intrigu open problem attract attent recent main tool obtain weight bound theorem prove exist long edg steiner minim tree restrict set point dimension space gener theorem complex approxim illumin ddimension convex polyhedra preliminari version spars result graph spanner find weakli dvisibl chord polygon linear time extend abstract abstract chord simpl polygon weaidi uiaibleffeveri point visibl point chord give optim lineex time algorithm computea weakli visibl chord es polygon vertic fast algorithm construct spars euclidean spanner optim linear dtime algorithm shortest illumin line segment polygon simpl polygon present optim linear time algorithm comput shortest illumin line segment exist report exist solv intrigu open problem improv log time algorithm ke comput segment find weakli dvisibl chord polygon linear time abstract chord simpl polygon weaidi uiaibleffeveri point visibl point chord give optim lineex time algorithm computea weakli visibl chord es polygon vertic lr dvisibl polygon construct degre spanner spars properti set point dimension euclidean space subgraph complet euclidean graph spanner length shortest path spanner time show gt exist polynomi time constructihl spanner constant depend properti maximum degre edg total edg weight compar minimum span tree lt weight wt mgt gt weight log wt mst optim spars spanner ddimension euclidean space set point dimension euclidean space subgraph complet euclidean graph spanner length shortest path spanner time show gt greedi algorithm produc spanner edg total edg weight tot st mst minimum span tree spars spanner weight graph abstract graph subgraph spanner distanc time longer distanc paper give simpl algorithm construct spars spanner arbitrari weight graph appli algorithm obtain specif result planar graph euclidean graph discuss optim result present match lower bound spars result graph spanner geometr search link distanc extend abstract orthogon line segment plane intersect graph defin vertex correspond segment edg correspond pair intersect segment graph edg show breadth search accomplish log time space applic show minimum link rectilinear path point amidst rectilinear polygon obstacl comput nlog time space optim mention relat result paper minimum vertex hull polyhedr domain paper investig variat problem collect pairwis disjoint polygon spatial posit plane cover polygon hull hull pairwis disjoint geometr search link distanc extend abstract orthogon line segment plane intersect graph defin vertex correspond segment edg correspond pair intersect segment graph edg show breadth search accomplish log time space applic show minimum link rectilinear path point amidst rectilinear polygon obstacl comput nlog time space optim mention relat result paper minimum vertex hull polyhedr domain paper investig variat problem collect pairwis disjoint polygon spatial posit plane cover polygon hull hull pairwis disjoint gener spars spanner weight graph abstract graph subgraph spanner distanc time longer distanc paper give simpl algorithm construct spars spanner arbitrari weight graph appli algorithm obtain specif result planar graph euclidean graph discuss optim result present match lower bound triangul approxim complet graph abstract chew dobkin al shown delaunai triangul variant spars approxim complet graph shortest di tanc site triangul bound constant multipl euclidean separ paper show classic triangul algorithm greedi triangul notabl minimum weight triangul approxim complet graph sens design algorithm construct extrem spars nontriangular planar graph approx imat complet graph defin suffici condit show euclidean planar graph con struct algorithm satisfi condit produc good approxim complet graph condit gener satisfi tri angul algorithm mention graph algorithm partial answer question pose titl theoret standpoint result interest prove trivial properti minimum weight triangul practic standpoint graph algorithm good altern delaunai triangul design spars network se vere constraint total edg length final gener approach identifi design algorithm construct spars network 